Clustering PPI Networks of Mixed Host-Pathogen Data Using Biased Repeated Random Walks
نویسندگان
چکیده
Clustering protein-protein interaction (PPI) network data yields groups of proteins that are biochemically involved. Most existing clustering methods treat all the proteins in a PPI network equally. However, analyzing host-pathogen networks requires identification of clusters that represent the interactions between the set of pathogen proteins and the set of host proteins. For studying HIV-human protein-protein interactions, we thus need to identify clusters with the specific composition of at least one virus protein per cluster. Towards this goal, we describe a novel clustering method that focuses on the key virus proteins in a host-pathogen PPI network and utilizes the notion of random walks biased towards specific connectivity configurations. The proposed method finds host-pathogen protein clusters with high accuracy and improves upon the results obtained with other methods at the state-of-the-art.
منابع مشابه
Diffusion Model Based Spectral Clustering for Protein-Protein Interaction Networks
BACKGROUND A goal of systems biology is to analyze large-scale molecular networks including gene expressions and protein-protein interactions, revealing the relationships between network structures and their biological functions. Dividing a protein-protein interaction (PPI) network into naturally grouped parts is an essential way to investigate the relationship between topology of networks and ...
متن کاملStructural Models for Host-Pathogen Protein-Protein Interactions: Assessing Coverage and Bias
Recently, we applied structural systems biology to host-pathogen interaction and constructed the human-virus structural interaction network (SIN) based on a combination of solved structures and homology models. Subsequent analysis of the human-virus SIN revealed significant differences between antagonistic human-virus and cooperative within-human protein-protein interactions (PPIs). Although th...
متن کاملTopologically biased random walk and community finding in networks.
We present an approach of topology biased random walks for undirected networks. We focus on a one-parameter family of biases, and by using a formal analogy with perturbation theory in quantum mechanics we investigate the features of biased random walks. This analogy is extended through the use of parametric equations of motion to study the features of random walks vs parameter values. Furthermo...
متن کاملNon-Backtracking Centrality Based Random Walk on Networks
Random walks are a fundamental tool for analyzing realistic complex networked systems and implementing randomized algorithms to solve diverse problems such as searching and sampling. For many real applications, their actual effect and convenience depend on the properties (e.g. stationary distribution and hitting time) of random walks, with biased random walks often outperforming traditional unb...
متن کاملBiased random walks on multiplex networks
Biased random walks on complex networks are a particular type of walks whose motion is biased on properties of the destination node, such as its degree. In recent years they have been exploited to design efficient strategies to explore a network, for instance by constructing maximally mixing trajectories or by sampling homogeneously the nodes. In multiplex networks, the nodes are related throug...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013